Straight-Line Rectangular Drawings of Clustered Graphs
نویسندگان
چکیده
منابع مشابه
Straight-Line Rectangular Drawings of Clustered Graphs
We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006 ].
متن کاملStraight-line Drawings of 1-planar Graphs
The classical Fáry’s theorem from the 1930s states that every planar graph can be drawn as a straight-line drawing. In this paper, we extend Fáry’s theorem to non-planar graphs. More specifically, we study the problem of drawing 1-planar graphs with straight-line edges. A 1-planar graph is a sparse non-planar graph with at most one crossing per edge. We give a characterisation of those 1planar ...
متن کاملHybrid GA for Straight-Line Drawings of Level Clustered Planar Graphs
∗ Corresponding author. Abstract In this paper we introduce an application of genetic algorithms (GAs) with the problem of drawing of level planar graph or hierarchical planar graph, and explore the potential use of GAs to solve this particular problem. Given a l evel planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-int...
متن کاملStraight-Line Grid Drawings of 3-Connected 1-Planar Graphs
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straightline drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any...
متن کاملGA for straight-line grid drawings of maximal planar graphs
osting by E Abstract A straight-line grid drawing of a planar graph G of n vertices is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Finding algorithms for straight-line grid drawings of maximal planar graphs (MPGs) in the minimum area is still an elusive goal. In this paper we explore t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2010
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-010-9302-z